Corpus ID: 18409213

Integrating Finite-state Technology with Deep LFG Grammars

  title={Integrating Finite-state Technology with Deep LFG Grammars},
  author={R. Kaplan and John T. Maxwell and Tracy Holloway King and Dick Crouch},
Researchers at PARC were pioneers in developing finite-state methods for applications in computational linguistics, and one of the original motivations was to provide a coherent architecture for the integration of lower-level lexical processing with higher-level syntactic analysis (Kaplan and Kay, 1981; Karttunen et al., 1992; Kaplan and Kay, 1994). Finite-state methods for tokenizing and morphological analysis were initially incorporated into the Grammar-writer’s Workbench for Lexical… Expand
An LFG Chinese Grammar for Machine Use
This paper describes the Chinese grammar developed at PARC, including its three basic components: the tokenizer and tagger, lexicon and syntactic rules, and presents the methods of handling these issues. Expand
Urdu in a parallel grammar development environment
The Urdu grammar was able to take advantage of standards in analyses set by the original grammars in order to speed development, but novel constructions, such as correlatives and extensive complex predicates, resulted in expansions of the analysis feature space as well as extensions to the underlying parsing platform. Expand
A Morphological Analyzer For Wolof Using Finite-State Techniques
The methods used to model complex morphological issues and on developing strategies to limit ambiguities are focused on, as a first step towards a computational grammar for the language in the Lexical Functional Grammar framework. Expand
Issues at the Morphology-Syntax Interface in the Urdu ParGram Grammar June
  • 2007
As part of the ParGram project (Butt et al. 1999, 2002), we are developing a grammar for the South Asian language Urdu. Very few resource s exist for this language, in particular, no broad-coverageExpand
Implementation and Evaluation of an LFG-based Parser for Wolof
A parsing system for Wolof based on the LFG formalism, which covers core constructions of Wolof, including noun classes, cleft, copula, causative and applicative sentences and deals with several types of coordination, including same constituent coordination, asymmetric and asyndetic coordination. Expand
The importance of precise tokenizing for deep grammars
We present a non-deterministic finite-state transducer that acts as a tokenizer and normalizer for free text that is input to a broad-coverage LFG of German. We compare the basic tokenizer used in anExpand
Pruning the Search Space of the Wolof LFG Grammar Using a Probabilistic and a Constraint Grammar Parser
A method for greatly reducing parse times in LFG by integrating a Constraint Grammar parser into a probabilistic context-free grammar, using the c-structure pruning mechanism of XLE. Expand
TuLiPA: Towards a Multi-Formalism Parsing Environment for Grammar Engineering
An open-source parsing environment (Tubingen Linguistic Parsing Architecture, TuLiPA) is presented which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. Expand
Computational Aspects of Lexical Functional Grammar
  • M. Forst
  • Computer Science
  • Lang. Linguistics Compass
  • 2011
The formal and computational foundations of LFG are introduced by presenting the correspondence architecture via which the central linguistic representations of L FG, c-st structure and f-structure, are linked, and the computational complexity of LFT parsing is addressed. Expand
Urdu and the Modular Architecture of ParGram
Overall, Lexical-Functional Grammar in conjunction with the XLE development platform allows not only for robust and large-scale natural language parsing and generation, but also for the incorporation of deep linguistic insights. Expand


Lexical Resource Reconciliation in the Xerox Linguistic Environment
  • R. Kaplan
  • Computer Science
  • Workshop On Computational Environments For Grammar Development And Linguistic Engineering
  • 1997
This paper motivates and describes those aspects of the Xerox Linguistic Environment (XLE) that facilitate the construction of broad-coverage Lexical Functional grammars by incorporatingExpand
Finite State Morphology
This volume is a practical guide to finite-state theory and the affiliated programming languages lexc and xfst, and readers will learn how to write tokenizers, spelling checkers, and especially morphological analyzer/generators for words in English, French, Finnish, Hungarian and other languages. Expand
Lexical Functional Grammar A Formal System for Grammatical Representation
This work has adopted the Competence Hypothesis as a methodological principle, and assumes that an explana tory model of human language performance will incorporate a theoreti cally justi ed representation of the native speaker s linguistic knowledge a grammar as a component separate both from the computational mech anisms that operate on it a processor and from other nongrammatical processing parameters that might in uence the processor s behavior. Expand
Low-Level Mark-Up and Large-scale LFG Grammar Processing
It is commonly believed that shallow mark-up techniques such as part-of-speech disambiguation or low-level phrase chunking provide useful information that can improve the performance of naturalExpand
Parsing the Wall Street Journal using a Lexical-Functional Grammar and Discriminative Estimation Techniques
The model combines full and partial parsing techniques to reach full grammar coverage on unseen data, and on a gold standard of manually annotated f-structures for a subset of the WSJ treebank, reaches 79% F-score. Expand
Japanese Parser on the basis of the Lexical-Functional Grammar Formalism and its Evaluation
We report a Japanese parsing system with a linguistically fine-grained grammar based on the Lexical-Functional Grammar (LFG) formalism. The system is the first Japanese LFG parser with over 97%Expand
Speed and Accuracy in Shallow and Deep Stochastic Parsing
This paper reports some experiments that Compare the accuracy and performance of two stochastic parsing systems and found the deep-parsing system to be more accurate than the Collins parser with only a slight reduction in parsing speed. Expand
Two-Level Morphology with Composition
Two-Level Morphology with Composition Lauri Karttunen, Ronald M. Kaplan, and Annie Zaenen Xerox Palo Alto Research Center Center for the Study of language and Information StanJbrd University 1.Expand
Regular Models of Phonological Rule Systems
This paper shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemi's two-level formalism. Expand
Extended Models and Tools for High-performance Part-of-speech
To cope with the data sparseness problem caused by exceptional phenomena, the concept of position-wise grouping where the tag set is partitioned into different equivalence classes at each position in the conditional probabilities in the Markov Model is introduced. Expand