[图书][B] The syntactic process
M Steedman - 2001 - books.google.com
This book covers topics in formal linguistics, intonational phonology, computational
linguistics, and experimental psycholinguistics, presenting them as an integrated theory of …
linguistics, and experimental psycholinguistics, presenting them as an integrated theory of …
[图书][B] Handbook of natural language processing
N Indurkhya, FJ Damerau - 2010 - taylorfrancis.com
The Handbook of Natural Language Processing, Second Edition presents practical tools
and techniques for implementing natural language processing in computer systems. Along …
and techniques for implementing natural language processing in computer systems. Along …
Tree-adjoining grammars
AK Joshi, Y Schabes - Handbook of Formal Languages: Volume 3 Beyond …, 1997 - Springer
In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG)
and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic …
and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic …
Combinatory categorial grammar
M Steedman, J Baldridge - Non‐Transformational Syntax …, 2011 - Wiley Online Library
Categorial Grammar (CG; Ajdukiewicz 1935; Bar-Hillel 1953) is one of the oldest lexicalized
grammar formalisms, in which all grammatical constituents are distinguished by a syntactic …
grammar formalisms, in which all grammatical constituents are distinguished by a syntactic …
Principles and implementation of deductive parsing
SM Shieber, Y Schabes, FCN Pereira - The Journal of logic programming, 1995 - Elsevier
We present a system for generating parsers based directly on the metaphor of parsing as
deduction. Parsing algorithms can be represented directly as deduction systems, and a …
deduction. Parsing algorithms can be represented directly as deduction systems, and a …
The equivalence of four extensions of context-free grammars
K Vijay-Shanker, DJ Weir - Mathematical systems theory, 1994 - Springer
There is currently considerable interest among computational linguists in grammatical
formalisms with highly restricted generative power. This paper concerns the relationship …
formalisms with highly restricted generative power. This paper concerns the relationship …
[图书][B] Parsing beyond context-free grammars
L Kallmeyer - 2010 - books.google.com
Given that context-free grammars (CFG) cannot adequately describe natural languages,
grammar formalisms beyond CFG that are still computationally tractable are of central …
grammar formalisms beyond CFG that are still computationally tractable are of central …
Data and models for statistical parsing with Combinatory Categorial Grammar
J Hockenmaier - 2003 - era.ed.ac.uk
This dissertation is concerned with the creation of training data and the development of
probability models for statistical parsing of English with Combinatory Categorial Grammar …
probability models for statistical parsing of English with Combinatory Categorial Grammar …
[PDF][PDF] Inside-outside and forward-backward algorithms are just backprop (tutorial paper)
J Eisner - Proceedings of the Workshop on Structured Prediction …, 2016 - aclanthology.org
A probabilistic or weighted grammar implies a posterior probability distribution over possible
parses of a given input sentence. One often needs to extract information from this …
parses of a given input sentence. One often needs to extract information from this …