Srinivas Bangalore, Patrick Haffner, and Gaël Emami. 2005. Factoring global inference by enriching local representations. Technical report, AT&T Labs -- Reserach.

Google Scholar

[3]

Pierre Boullier and Philippe Deschamp. 1988. Le système Syntax#8482; -- manuel d'utilisation et de mise en &oelig;uvre sous Unix#8482;. http://syntax.gforge.inria.fr/syntax3.8-manual.pdf.

Google Scholar

[4]

Pierre Boullier and Benoît Sagot. 2007. Are very large grammars computationnaly tractable? In Proceedings of IWPT'07, Prague, Czech Republic.

Crossref

Google Scholar

[5]

Pierre Boullier. 2003. Guided Earley parsing. In Proceedings of the 7th International Workshop on =20 Parsing Technologies, pages 43--54, Nancy, France.

Google Scholar

[6]

John Chen. 2001. Towards Efficient Statistical Parsing Using Lexicalized Grammatical Information. Ph.D. thesis, University of Delaware.

Digital Library

Google Scholar

[7]

Stephen Clark and James R. Curran. 2004. Parsing the WSJ using CCG and log-linear models. In ACL'04.

Digital Library

Google Scholar

[8]

Jay Earley. 1970. An efficient context-free parsing algorithm. Communication of the ACM, 13(2):94--102.

Digital Library

Google Scholar

[9]

Liang Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of IWPT'05, Vancouver, Canada.

Digital Library

Google Scholar

[10]

Rebecca Hwa. 2001. Learning Probabilistic Lexicalized Grammars for Natural Language Processing. Ph.D. thesis, Harvard University.

Digital Library

Google Scholar

[11]

Aravind K. Joshi. 1987. An introduction to Tree Adjoining Grammars. In A. Manaster-Ramer, editor, Mathematics of Language. John Benjamins, Amsterdam.

Google Scholar

[12]

Roger Levy and Christopher Manning. 2004. Deep dependencies from context-free statistical parsers: Correcting the surface dependency approximation. In ACL'04.

Digital Library

Google Scholar

[13]

Dekang Lin. 1994. PRINCIPAR--an efficient, broad-coverage, principle-based parser. In Coling'94.

Digital Library

Google Scholar

[14]

Alexis Nasr and Owen Rambow. 2006. Parsing with lexicalized probabilistic recursive transition networks. In Finite-State Methods and Natural Language Processing, Springer Verlag Lecture Notes in Commputer Science.

Google Scholar

[15]

Joakim Nivre, Johan Hall, and Jens Nilsson. 2004. Memory-based dependency parsing. In CoNLL-2004.

Google Scholar

[16]

Yves Schabes and Stuart Shieber. 1994. An alternative conception of tree-adjoining derivation. Computational Linguistics, 1(20):91--124.

Digital Library

Google Scholar

[17]

Yves Schabes and Richard C. Waters. 1995. Tree Insertion Grammar. Computational Linguistics, 21(4).

Google Scholar

[18]

Libin Shen and Aravind Joshi. 2005. Incremental ltag parsing. In HLT-EMNLP'05.

Digital Library

Google Scholar

[19]

Wen Wang and Mary P. Harper. 2004. A statistical constraint dependency grammar (CDG) parser. In Proceedings of the ACL Workshop on Incremental Parsing.

Digital Library

Google Scholar

Cited By

View all

Hassani KLee W(2016)Visualizing Natural Language DescriptionsACM Computing Surveys10.1145/293271049:1(1-34)Online publication date: 29-Jun-2016
https://dl.acm.org/doi/10.1145/2932710
Passonneau REpstein SLigorio TGordon JMoore JTraum DChai JPassonneau R(2011)Embedded wizardryProceedings of the SIGDIAL 2011 Conference10.5555/2132890.2132917(248-258)Online publication date: 17-Jun-2011
https://dl.acm.org/doi/10.5555/2132890.2132917
Thadani KMcKeown KFilippova KWan S(2011)Towards strict sentence intersectionProceedings of the Workshop on Monolingual Text-To-Text Generation10.5555/2107679.2107685(43-53)Online publication date: 24-Jun-2011
https://dl.acm.org/doi/10.5555/2107679.2107685
Show More Cited By

Index Terms

MICA: a probabilistic dependency parser based on tree insertion grammars application note
1. Computing methodologies
  1. Artificial intelligence
    1. Natural language processing
  2. Modeling and simulation
    1. Model development and analysis
      1. Model verification and validation
2. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages
  2. Semantics and reasoning
    1. Program reasoning
      1. Parsing

Recommendations

MICA: A Multilinear ICA Decomposition for Natural Scene Modeling

We refine the classical independent component analysis (ICA) decomposition using a multilinear expansion of the probability density function of the source statistics. In particular, we introduce a specific nonlinear system that allows us to elegantly ...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
A feature-guided grammatical system

Comments

Information & Contributors

Information

Published In

NAACL-Short '09: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers

May 2009

317 pages

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 31 May 2009

Qualifiers

Research-article

Acceptance Rates

Overall Acceptance Rate 21 of 29 submissions, 72%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
160
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)10

Reflects downloads up to 25 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hassani KLee W(2016)Visualizing Natural Language DescriptionsACM Computing Surveys10.1145/293271049:1(1-34)Online publication date: 29-Jun-2016
https://dl.acm.org/doi/10.1145/2932710
Passonneau REpstein SLigorio TGordon JMoore JTraum DChai JPassonneau R(2011)Embedded wizardryProceedings of the SIGDIAL 2011 Conference10.5555/2132890.2132917(248-258)Online publication date: 17-Jun-2011
https://dl.acm.org/doi/10.5555/2132890.2132917
Thadani KMcKeown KFilippova KWan S(2011)Towards strict sentence intersectionProceedings of the Workshop on Monolingual Text-To-Text Generation10.5555/2107679.2107685(43-53)Online publication date: 24-Jun-2011
https://dl.acm.org/doi/10.5555/2107679.2107685
Thadani KMcKeown KLin D(2011)Optimal and syntactically-informed decoding for monolingual phrase-based alignmentProceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 210.5555/2002736.2002789(254-259)Online publication date: 19-Jun-2011
https://dl.acm.org/doi/10.5555/2002736.2002789
Faili HBasirat A(2011)An unsupervised approach for linking automatically extracted and manually crafted LTAGsProceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I10.5555/1964799.1964807(68-81)Online publication date: 20-Feb-2011
https://dl.acm.org/doi/10.5555/1964799.1964807
Prabhakaran VRambow ODiab MJoshi AHuang CJurafsky D(2010)Automatic committed belief taggingProceedings of the 23rd International Conference on Computational Linguistics: Posters10.5555/1944566.1944683(1014-1022)Online publication date: 23-Aug-2010
https://dl.acm.org/doi/10.5555/1944566.1944683
Prabhakaran VFarkas RVincze VSzarvas GMóra GCsirik J(2010)Uncertainty learning using SVMs and CRFsProceedings of the Fourteenth Conference on Computational Natural Language Learning --- Shared Task10.5555/1870535.1870554(132-137)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.5555/1870535.1870554
Passonneau REpstein SLigorio TGordon JBhutada PKaplan R(2010)Learning about voice search for spoken dialogue systemsHuman Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics10.5555/1857999.1858125(840-848)Online publication date: 2-Jun-2010
https://dl.acm.org/doi/10.5555/1857999.1858125

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

MICA: A Multilinear ICA Decomposition for Natural Scene Modeling

Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

A feature-guided grammatical system

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations