FINITE-STATE AUTOMATA: Related Papers in ACL Anthology
Back to Document Index
Back to Term Index
-
Concordance view (Keyword-In-Context) for the term finite-state automata in the ACL ARC 2.0;
- Concordance view in the ACL ARC 1.0 (Sketch Engine Service).
FINITE-STATE AUTOMATA can be found in the following ACL ARC 1.0 documents (click to explore):
- (ACL ID: C00-1008) incremental identification of inflectional types
- (ACL ID: C00-1054) finite-state multimodal parsing and understanding
- (ACL ID: C00-2089) tagging and chunking with bigrams
- (ACL ID: C00-2095) a formalism for universal segmentation of text
- (ACL ID: C88-1006) morphology with two-level rules and negative rule features
- (ACL ID: C92-1027) compiling and using finite-state syntactic rules
- (ACL ID: C92-3153) text disambiguation by finite state automata, an algorithm and experiments on corpora
- (ACL ID: C96-1047) finite-state phrase parsing by rule sequences
- (ACL ID: C96-1051) segmentation and labelling of slovenian diphone inventories
- (ACL ID: C96-2105) parallel replacement in finite state calculus
- (ACL ID: E93-1069) ambiguity resolution in a reductionistic parser
- (ACL ID: E95-1022) a syntax-based part-of-speech analyser
- (ACL ID: E95-1028) rapid development of morphological descriptions for full language processing systems
- (ACL ID: E95-1038) a state-transition grammar for data-oriented parsing
- (ACL ID: E99-1035) a cascaded finite-state parser for syntactic analysis of swedish
- (ACL ID: H93-1026) fastus
- (ACL ID: I05-2007) a resource-based korean morphological annotation system
- (ACL ID: J00-1002) incremental construction of minimal acyclic finite-state automata
- (ACL ID: J00-1005) treatment of epsilon moves in subset construction
- (ACL ID: J00-3003) dialogue act modeling for automatic tagging and recognition of conversational speech
- (ACL ID: J02-2004) incremental construction and maintenance of minimal finite-state automata
- (ACL ID: J04-2005) squibs and discussions
- (ACL ID: J94-1003) one-level phonology
- (ACL ID: J94-3001) regular models of phonological rule systems
- (ACL ID: J94-3010) phonological analysis in typed feature systems
- (ACL ID: J95-2004) deterministic part-of-speech tagging with finite-state transducers
- (ACL ID: J96-2002) datr
- (ACL ID: J96-4003) learning bias and phonological-rule induction
- (ACL ID: J97-3004) an efficient implementation of the head-corner parser
- (ACL ID: J97-4003) a computational treatment of lexical rules in hpsg as covariation in lexical entries
- (ACL ID: J99-4004) semiring parsing
- (ACL ID: M92-1019) sri international fastus system muc-4 test results and analysis
- (ACL ID: N01-1015) re-engineering letter-to-sound rules
- (ACL ID: N03-1009) simpler and more general minimization for weighted finite-state automata
- (ACL ID: N06-1054) a fast finite-state relaxation method for enforcing global constraints on sequence decoding
- (ACL ID: P02-1001) parameter estimation for probabilistic finite-state transducers
- (ACL ID: P04-1007) discriminative language modeling with conditional random fields and the perceptron algorithm
- (ACL ID: P04-1065) fsa
- (ACL ID: P04-3023) on the equivalence of weighted finite-state transducers
- (ACL ID: P06-2061) integration of speech to computer-assisted translation using finite-state automata
- (ACL ID: P89-1003) a three-valued interpretation of negation in feature structure descriptions
- (ACL ID: P94-1028) compact representations by finite-state transducers
- (ACL ID: P95-1003) the replace operator
- (ACL ID: P96-1022) semhe a generalised two-level system
- (ACL ID: P97-1040) efficient generation in primitive optimality theory
- (ACL ID: P97-1042) compiling regular formalisms with rule features into finite-state automata
- (ACL ID: P97-1058) approximating context-free grammars with a finite-state calculus
- (ACL ID: P97-1060) representing constraints with automata
- (ACL ID: P98-1018) consonant spreading in arabic stems
- (ACL ID: P98-1030) terminology finite-state preprocessing for computational lfg
- (ACL ID: P98-2183) a descriptive characterization of tree-adjoining languages
- (ACL ID: P98-2240) discovering phonotactic finite-state automata by genetic search
- (ACL ID: W00-0732) improving chunking by means of lexical-contextual information in statistical language models
- (ACL ID: W00-1107) rextor
- (ACL ID: W00-1427) robust, applied morphological generation
- (ACL ID: W01-1202) maya
- (ACL ID: W01-1410) machine translation with grammar association
- (ACL ID: W02-0102) an interactive spreadsheet for teaching the forward-backward algorithm
- (ACL ID: W02-0110) formal language theory for natural language processing
- (ACL ID: W02-0604) unsupervised learning of morphology without morphemes
- (ACL ID: W03-0807) current issues in software engineering for natural language processing
- (ACL ID: W04-0104) automatic acquisition of feature-based phonotactic resources
- (ACL ID: W05-1504) parsing with soft and hard constraints on dependency length
- (ACL ID: W06-3601) a syntax-directed translator with extended domain of locality
- (ACL ID: W06-3605) a probabilistic search for the best solution among partially completed candidates
- (ACL ID: W94-0201) automated tone transcription
- (ACL ID: W97-0414) a polish-to-english text-to-text translation system based on an electronic dictionary
- (ACL ID: W97-0902) developing a new grammar checker for english as a second language
- (ACL ID: W97-1105) a lexical database tool for quantitative phonological research
- (ACL ID: W97-1409) planning referential acts for animated presentation agents
- (ACL ID: W97-1513) hdrug. a flexible and extendible development environment for natural language processing.
- (ACL ID: W98-0902) computing declarative prosodic morphology
- (ACL ID: W98-0905) an approach to the automatic acquisition of phonotactic constraints
- (ACL ID: W98-1007) arabic morphology using only finite-state operations
- (ACL ID: W98-1211) linguistic theory in statistical language learning
- (ACL ID: W98-1306) treatment of e-moves in subset construction
- (ACL ID: W98-1311) using genericity to create cutomizable finite-state tools
- (ACL ID: W99-0511) a computational lexicon of portuguese for automatic text parsing
* See also a list of some of the related terms to finite-state automata.
Back to Description Index