FINITE AUTOMATA: Related Papers in ACL Anthology
Back to Document Index
Back to Term Index
-
Concordance view (Keyword-In-Context) for the term finite automata in the ACL ARC 2.0;
- Concordance view in the ACL ARC 1.0 (Sketch Engine Service).
FINITE AUTOMATA can be found in the following ACL ARC 1.0 documents (click to explore):
- (ACL ID: A94-1013) adaptive sentence boundary disambiguation
- (ACL ID: A97-1023) techniques for accelerating a grammar-checker
- (ACL ID: C00-2134) lexicalized tree automata-based grammars for translating conversational texts
- (ACL ID: C00-2138) identifying temporal expression and its syntactic role using fst and lexical data from corpus
- (ACL ID: C04-1011) kullback-leibler distance between probabilistic context-free grammars and probabilistic finite automata
- (ACL ID: C04-1094) using syntactic information to extract relevant terms for multi-document summarization
- (ACL ID: C88-1041) the psi/phi architecture for prosodic parsing
- (ACL ID: C92-3153) text disambiguation by finite state automata, an algorithm and experiments on corpora
- (ACL ID: E87-1005) a morphological processor for modern greek
- (ACL ID: E93-1035) on abstract finite-state morphology
- (ACL ID: H05-1101) some computational complexity results for synchronous context-free grammars
- (ACL ID: H94-1050) weighted rational transductions and their application to human language processing
- (ACL ID: J00-1002) incremental construction of minimal acyclic finite-state automata
- (ACL ID: J00-1003) practical experiments with regular approximation of context-free languages
- (ACL ID: J00-1005) treatment of epsilon moves in subset construction
- (ACL ID: J00-1006) multitiered nonlinear morphology using multitape finite automata
- (ACL ID: J02-2004) incremental construction and maintenance of minimal finite-state automata
- (ACL ID: J05-2002) a general technique to train language models on language models
- (ACL ID: J83-1002) denotational semantics for "natural" language question-answering programs
- (ACL ID: J85-4003) the concept of superautomaton
- (ACL ID: J90-1002) an interpretation of negation in feature structure descriptions
- (ACL ID: J91-2001) features and formulae
- (ACL ID: J94-1003) one-level phonology
- (ACL ID: J94-3001) regular models of phonological rule systems
- (ACL ID: J97-2002) adaptive multilingual sentence boundary disambiguation
- (ACL ID: M95-1010) university of manitoba
- (ACL ID: P02-1015) parsing non-recursive cfgs
- (ACL ID: P04-1057) error mining for wide-coverage grammar engineering
- (ACL ID: P84-1026) syntactic and semantic parsability
- (ACL ID: P84-1080) two-way finite automata and dependency grammar
- (ACL ID: P86-1020) bulk processing of text on a massively parallel computer
- (ACL ID: P89-1003) a three-valued interpretation of negation in feature structure descriptions
- (ACL ID: P91-1033) feature logic with weak subsumption constraints
- (ACL ID: P93-1019) feature-based allomorphy
- (ACL ID: P96-1032) efficient tabular l r parsing
- (ACL ID: P97-1058) approximating context-free grammars with a finite-state calculus
- (ACL ID: P98-1010) a memory-based approach to learning shallow natural language patterns
- (ACL ID: P98-1111) unlimited vocabulary grapheme to phoneme conversion for korean t ts
- (ACL ID: P98-2147) dynamic compilation of weighted context-free grammars
- (ACL ID: W03-0907) story understanding through multi-representation model construction
- (ACL ID: W04-2907) general indexation of weighted automata - application to spoken utterance retrieval
- (ACL ID: W05-0507) item based constructions and the logical problem
- (ACL ID: W05-1501) efficient and robust lfg parsing
- (ACL ID: W05-1508) treebank transfer
- (ACL ID: W94-0104) study and implementation of combined techniques for automatic extraction of terminology
- (ACL ID: W98-0905) an approach to the automatic acquisition of phonotactic constraints
- (ACL ID: W98-1306) treatment of e-moves in subset construction
- (ACL ID: W99-0803) web tools for introductory computational linguistics
- (ACL ID: X96-1036) integration of document detection and information extraction
* See also a list of some of the related terms to finite automata.
Back to Description Index