We propose a joint inference algorithm for grammatical error correction. Different from most previous work where different error types are corrected independently, our proposed inference process considers all possible errors in a uni ed framework. We use integer linear programming (ILP) to model the inference process, which can easily incorporate both the power of existing error classi ers and ...

In this paper, we present an efficient algorithm for parsing natural language using unification grammars. The algorithm is an extension of left-corner parsing, a bottom-up algorithm which utilizes top-down expectations. The extension exploits unification grammar’s uniform representation of syntactic, semantic, and domain knowledge, by incorporating all types of grammatical knowledge into parser...

I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex representations implicit in our knowledge of language. To develop the account, I argue that natural language is structured in a way that lets us formalize grammatical knowledge precisely in terms of rich primitives of inte...

â  â  â  reasons of differences in grammatical opinions among the ancients â â â â â â â  ryadh alsawad * â  marzieh ghorbankhani ** â  â  abstract â â â  the most important characteristic of the rules of arabic language is their extent and diversity, so that they are difficult for learners to manage and learn. there are different reasons that play role in formation of this diversity. some reas...

Reference resolution is a major component of any natural language system. In the past 30 years significant progress has been made in coreference resolution. However, there is more anaphora in texts than coreference. I present a computational treatment of other-anaphora, i.e., referential noun phrases (NPs) with non-pronominal heads modified by “other” or “another”: [. . . ] the move is designed...