... expand out each of the three cases: (1 3a) homorganic-nasal-cluster ~ labial-nasal labial-obstruent (13b) homorganie-nasal-cluster ~ coronal-nasal coronal-obstruent (13c) homorganic-nasal-cluster ... constraint. Nasal-cluster and place-assimilation are defined as: (1 7a) (setq nasal-cluster-lattice (M. nasal-lattice obstruent-lattice)) (17b) (setq place-assimilation-lattice (M + (M** labial-lattice) ... to handle only the simpler finitestate case. 1° 2 3 Feature Manipulation Although "pure" unaugmented finitestate grammars may be adequate fur speech applications (in the weak generative...
... 2004. A maximum-entropy Chinese parser augmented by transformation-based learning.ACM Transactions on Asian Language InformationProcessing, 3(2):159–168.Mary Hearne and Andy Way. 2004. Data-orientedparsing ... timesfaster than Levy and Manning’s parser, and 270times faster than Bikel’s parser. Another advan-tage of our parser is that it does not take as muchmemory as these other parsers do. In fact, ... for many practical applications.Deterministic parsing has emerged as an attrac-tive alternative to probabilistic parsing, offeringaccuracy just below the state- of-the-art in syn-tactic analysis...
... on Language Resources and Evaluation (LREC),pages 1974–1981, Las Palmas, Spain, May.Julia Hockenmaier and Mark Steedman. 2002b. Generativemodels for statistical parsing with Combinatory CategorialGrammar. ... Rambow. 1994. Formal and Computational Aspectsof Natural Language Syntax. Ph.D. thesis, University ofPennsylvania, Philadelphia PA.Libin Shen and Aravind K. Joshi. 2005. Incremental LTAGparsing. ... implementation, each node cannot havemore than one forward and one backward extraposed elementand one forward and one backward trace. It may be preferableto use list structures instead, especially...
... indicates any un- stressed vowel, "v" any stressed vowel, 'dx' a flap, and 'C' any consonant other than 't', 'r' or 'dx'. '#' ... underlying forms as input and generate surface forms as output. The algorithm for learning them is an extension of the OSTIA algorithm for learn- ing general subsequential finitestate transduc- ... In addi- tion, no generalizations are made about similar context phonemes. In a transducer based formalism, general- izations about similar context phonemes naturally follow from generalizations...
... source and target lan-guage, and alternative translation possibilities areexpressed as alternative edges. Edges are furtherannotated with feature values, and are annotatedwith the source span ... statistical machinetranslation: parameter estimation. Computational Lin-guistics, 19(2):263–311.D. Chiang, K. Knight, and W. Wang. 2009. 11,001 newfeatures for statistical machine translation. ... T. Ward, and W J. Zhu. 2002.BLEU: a method for automatic evaluation of machinetranslation. In Proc. of ACL, pages 311–318.M. Riedmiller and H. Braun. 1993. A direct adaptive method for faster...
... moreinformation in lexical entries and increasing am-biguity so that other ambiguity types also can bedisambiguated in a similar way via lexical cate-gory disambiguation. This idea has been ... Language,, 47:50–68,2002.C.D. Manning and H. Sch¨utze. Foundations ofStatistical Natural Language Processing. TheMIT Press, Cambridge, Massachusetts, 1999.S. Narayanan and D Jurafsky. A ... of parameters until additionalparameters are demanded by data. Equally impor-tant, the quality of architectural simplicity shouldbe maintained. Among the different sources ofinformation manipulated...
... merging all the final states into one. The parser maintains a dynamic record of which trees are valid for states (in particular fi- nal states) in the parse table. This means that we can minimise ... the main spine. The automata for both the primary and secondary anchors associated with a lexical item could then be merged, minimized and used for parsing as above. Using automata for parsing ... precompilation tech- nique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finitestate automata...
... Number 10, Stanford, CA. Carl Pollard. 1984. Generalized Phrase Structure Grammars, Head Grammars and Natural Lan- guage. Ph.D. thesis, Stanford University. Michael Reape. 1991. Parsing bounded ... information that a semantic head provides. For example, a head usually provides information about the remaining daughters that the parser must find, and (since the head daughter in a construction ... ConTroll also allows a parsing strategy to be specified within the same formalism as the grammar. 3 Our imple- mentation of the head-corner parser adapts van No- ord's (1997) parser to...
... language engineering.2 Transducers and Parameters Finite- state machines, including finite -state au-tomata (FSAs) and transducers (FSTs), are a kindof labeled directed multigraph. For ease and ... Industrial and Applied Math.Kevin Knight and Yaser Al-Onaizan. 1998. Translationwith finite -state devices. In Proc. of AMTA.Kevin Knight and Jonathan Graehl. 1998. Machinetransliteration. Computational ... explain them by example. Fig. 1a shows a proba-bilistic FST with input alphabet Σ = {a, b}, outputalphabet ∆ = {x, z}, and all states final. It maybe regarded as a device for generating a string...
... GRAMMARS The grammars which are supported by the parser are a subset of those for Structure Unification Grammar. These grammars are for the most part lexicalized. Each lexicalized grammar ... Categorial Grammar, Lexi- cal Functional Grammar, and Head-driven Phrase Structure Grammar. An SUG grammar is a set of partial descrip- tions of phrase structure trees. Each SUG gram- mar ... In Lawrence Davis, editor, Genetic Algorithms and Simulated Annealing, chapter 11, pages 141- 154. Morgan Kaufmann Publishers, Los Altos, CA. Shastri, Lokendra and Ajjanagadde, Venkat (1990)....
... Johnson and Paul M. Postal. Are Pair Grammar. Princeton University Press, 1980. [4] Ronald Kaplan and Joan Bresnan. Lexical- functional grammar, a formal system for grammatical representation. ... suitable for building computational relational grammars. A lexicalized SFG is sim- ply a collection of stratified feature graphs (S- graphs), each of which is anchored to a lexical item, analogous ... in a ~o~ally closed label. Additionally, we assume that all labels in well-formed lexicalized graphs (the input graphs to the parsing algorithm) are at least partially closed. This leaves...
... data and tools.In Proceedings of the NEMLAR International Con-ference on Arabic Language Resources and Tools,pages 110–117.Jan Hajiˇc, Jarmila Panevov´ a, Eva Hajiˇcov´ a, JarmilaPanevov´ a, ... fact that very little efforthas been spent on optimizing the training oracleand feature model for the 2-planar parser so far.It is worth mentioning that the 2-planar parser has two advantages ... to get a first estimate of the empirical ac-curacy that can be obtained with transition-based2-planar parsing, we have evaluated the parser on four data sets from the CoNLL-X shared task(Buchholz...