scholarly journals Logic Programming for Linguistics: A short introduction to Prolog, and Logic Grammars with Constraints as an easy way to Syntax and Semantics

Triangle ◽  
2018 ◽  
pp. 31
Author(s):  
Henning Christiansen

This article gives a short introduction on how to get started with logic programming in Prolog that does not require any previous programming experience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what a computer is, can follow the text. I cannot, of course, cover all aspects of logic programming in this text, and so we give references to other sources with more details.

Author(s):  
HSIN-HSI CHEN ◽  
I-PENG LIN ◽  
CHIEN-PING WU

The movement of constituents in natural language is a very common linguistic phenomenon— topicalization and relativization in Mandarin Chinese, for example. Any successful natural language processing system must be able to deal with these movements and, at the same time, justify them. However, it is difficult to achieve these goals due to the gaps in between the constituents. In this paper, a logic programming approach with Chomsky’s Government-Binding Theory (GB) attempts to solve this type of problems in Chinese language processing. According to GB, the rule of “move-α” moves anything anywhere, and the universal principles operate interactively to rule the illegal movements out. With this point of view, no specific movement constraints are specified in our logic programming approach. The universal principles are embedded in the logic grammars implicitly, and generated by a translator. The specific features of this approach enable grammar-writing to capture extrapositions in Chinese much easier than the other approaches.


2001 ◽  
Vol 10 (04) ◽  
pp. 573-588 ◽  
Author(s):  
KIMBERLY D. VOLL ◽  
TOM P. YEH ◽  
VERONICA DAHL

We show how two novel tools in logic programming for AI (namely, continuation-based linear and timeless assumptions, and Datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for Datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words) that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.


2007 ◽  
pp. 42-63
Author(s):  
Sara Bender

The author discusses the history of the Jews of Chmielnik, a town situated 30 kilometres away from Kielce: from a short introduction covering the inter-war period, through the German invasion, ghetto formation, everyday life n the ghetto, deportations and the fate of the survivors. The author extensively describes social organisations and their activity in Chmielnik  (Judenrat, Ha Szomer ha-Cair), as well as the contacts between the Jews and the Poles.


2016 ◽  
Vol 9 (2) ◽  
pp. 295-296
Author(s):  
Jeremy Black
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document