Abstract
In this paper, we present an optimization for parsing with Lexicalized Tree-Adjoining Grammar which takes inspiration from previous work on polarity based grammar abstraction (Bonfante et al. [3]). We illustrate the impact of this optimization on two benchmarks and we relate our approach to the more general optimization framework proposed for Interaction Grammars by Bonfante et al. [2] and Morey [11].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Recall that the grammar is modified so that co-anchors are represented as substitution nodes and additional single node trees are added to match these nodes. This explains why the \(\alpha _\text {imp}\) tree schema carries a to polarity feature.
- 2.
- 3.
Crabbé’s metagrammar is available from https://sourcesup.renater.fr/scm/viewvc.php/trunk/METAGRAMMARS/FrenchTAG/?root=xmg and its French documentation from http://www.linguist.univ-paris-diderot.fr/~bcrabbe/frenchgrammar/.
References
Bangalore, S., Joshi, A.: Supertagging: an approach to almost parsing. Comput. Linguist. 25(2), 237–265 (1999)
Bonfante, G., Guillaume, B., Morey, M.: Dependency constraints for lexical disambiguation. In: IWPT 2009, pp. 242–253 (2009)
Bonfante, G., Guillaume, B., Perrier, G.: Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. In: COLING 2004, pp. 303–309 (2004)
Bonfante, G., Le Roux, J., Perrier, G.: Lexical disambiguation with polarities and automata. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 283–284. Springer, Heidelberg (2006)
Boullier, P.: Supertagging: a non-statistical parsing-based approach. In: IWPT 2003, pp. 55–66 (2003)
Crabbé, B.: Représentation informatique de grammaires fortement lexicalisées: application à la grammaire d’arbres adjoints. Ph.D. thesis, Université Nancy 2 (2005)
Duchier, D., Le Roux, J., Parmentier, Y.: The metagrammar compiler: An NLP application with a multi-paradigm architecture. In: Van Roy, P. (ed.) MOZ 2004. LNCS, vol. 3389, pp. 175–187. Springer, Heidelberg (2005)
Joshi, A., Schabes, Y.: Tree-Adjoining Grammar. Handbook of Formal Languages, pp. 69–123. Springer, Berlin (1997)
Lang, B.: Recognition can be harder than parsing. Comput. Intell. 10, 486–494 (1994)
Lehmann, S., Oepen, S., Regnier-Prost, S., Netter, K., Lux, V., Klein, J., Falkeda, K., Fouvry, F., Estival, D., Dauphin, E., Compagnion, H., Baur, J., Balkan, L., Arnold, D.: TSNLP - Test suites for natural language processing. In: COLING 1996, pp. 711–716 (1996)
Morey, M.: Étiquetage grammatical symbolique et interface syntaxe-sémantique des formalismes grammaticaux lexicalisés polarisés. Ph.D. thesis, Université de Lorraine (2011)
Parmentier, Y., Kallmeyer, K., Lichte, T., Maier, W., Dellert, J.: A syntax-semantics parsing environment for mildly context-sensitive formalisms. In: TAG+9, pp. 121–128 (2008)
Perrier, G.: Interaction grammars. In: COLING 2000, pp. 600–606 (2000)
Perrier, G.: Désambiguisation lexicale à l’aide d’automates de polarités. Technical report INRIA (2008). http://hal.archives-ouvertes.fr/inria-00278443
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gardent, C., Parmentier, Y., Perrier, G., Schmitz, S. (2014). Lexical Disambiguation in LTAG Using Left Context. In: Vetulani, Z., Mariani, J. (eds) Human Language Technology Challenges for Computer Science and Linguistics. LTC 2011. Lecture Notes in Computer Science(), vol 8387. Springer, Cham. https://doi.org/10.1007/978-3-319-08958-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-08958-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08957-7
Online ISBN: 978-3-319-08958-4
eBook Packages: Computer ScienceComputer Science (R0)