Natural language processing for prolog programmers:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Englewood Cliffs, NJ
Prentice Hall
1994
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XVI, 348 S. graph. Darst. |
| ISBN: | 0136292135 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV008283702 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 931021s1994 d||| |||| 00||| engod | ||
| 020 | |a 0136292135 |9 0-13-629213-5 | ||
| 035 | |a (OCoLC)299750031 | ||
| 035 | |a (DE-599)BVBBV008283702 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29 |a DE-29T | ||
| 050 | 0 | |a QA76.73.P76 | |
| 082 | 0 | |a 005.13/3 |2 20 | |
| 100 | 1 | |a Covington, Michael A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Natural language processing for prolog programmers |c Michael A. Covington |
| 264 | 1 | |a Englewood Cliffs, NJ |b Prentice Hall |c 1994 | |
| 300 | |a XVI, 348 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Natuurlijke-taalverwerking |2 gtt | |
| 650 | 7 | |a PROLOG |2 gtt | |
| 650 | 4 | |a Natural language processing (Computer science) | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 650 | 0 | 7 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Sprachverarbeitung |0 (DE-588)4116579-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |D s |
| 689 | 0 | 1 | |a Sprachverarbeitung |0 (DE-588)4116579-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005473571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005473571 | ||
Record in the Search Index
| _version_ | 1804122681382010880 |
|---|---|
| adam_text | NATURAL LANGUAGE PROCESSING FOR PROLOG PROGRAMMERS MICHAEL A. COVINGTON
ARTIFICIAL INTELLIGENCE PROGRAMS THE UNIVERSITY OF GEORGIA ATHENS,
GEORGIA PRENTICE HALL, UPPER SADDLE RIVER, NEW JERSEY 07458 CONTENTS
PREFACE XV 1 NATURAL LANGUAGE 1 1.1 WHAT IS NLP? 1 1.2 LANGUAGE FROM A
SCIENTIFIC VIEWPOINT 2 1.3 LANGUAGE AND THE BRAIN 4 1.4 LEVELS OF
LINGUISTIC ANALYSIS 5 1.4.1 PHONOLOGY, 5 1.4.2 MORPHOLOGY, 6 1.4.3
SYNTAX, 7 1.4.4 SEMANTICS, 9 1.4.5 PRAGMATICS, 10 1.5 WHY USE PROLOG? 12
1.6 FURTHER READING 12 2 TEMPLATES AND KEYWORDS 14 2.1 TEMPLATE MATCHING
14 VII VIII CONTENTS 2.1.1 ELIZA, 14 2.1.2 OTHER TEMPLATE SYSTEMS, 15
2.2 DOS COMMANDS IN ENGLISH 16 2.2.1 RECIPE FOR A TEMPLATE SYSTEM, 16
2.2.2 IMPLEMENTING SIMPLIFICATION RULES, 19 2.2.3 IMPLEMENTING
TRANSLATION RULES, 20 2.2.4 THE REST OF THE SYSTEM, 21 2.3 KEYWORD
ANALYSIS 24 2.3.1 A TIME-HONORED APPROACH, 24 2.3.2 DATABASE QUERYING,
25 2.3.3 A DATABASE IN PROLOG, 26 2.3.4 BUILDING A KEYWORD SYSTEM, 27
2.3.5 CONSTRUCTING A QUERY, 28 2.3.6 LAMBDA ABSTRACTION, 30 2.3.7
LAMBDAS IN PROLOG, 31 2.3.8 THE COMPLETE SYSTEM, 32 2.4 TOWARD MORE
NATURAL INPUT 34 2.4.1 ELLIPSIS, 34 2.4.2 ANAPHORA, 34 3 DEFINITE-CLAUSE
GRAMMARS 36 3.1 PHASE STRUCTURE 36 3.1.1 TREES AND PS RULES, 36 3.1.2
PHASE-STRUCTURE FORMALISM, 38 3.1.3 RECURSION, 40 3.2 TOP-DOWN PARSING
42 3.2.1 A PARSING ALGORITHM, 42 3.2.2 PARSING WITH PROLOG RULES, 43 3.3
DCG RULES 45 3.3.1 DCG NOTATION, 45 3.3.2 LOOPS, 48 3.3.3 SOME DETAILS
OF IMPLEMENTATION, 50 3.4 USING DCG PARSERS 51 3.4.1 BUILDING SYNTACTIC
TREES, 51 3.4.2 AGREEMENT, 54 3.4.3 CASE MARKING, 56 3.4.4
SUBCATEGORIZATION, 57 3.4.5 UNDOING SYNTACTIC MOVEMENTS, 59 3.4.6
SEPARATING LEXICON FROM PS RULES, 61 CONTENTS IX 3.5 BUILDING SEMANTIC
REPRESENTATIONS 63 3.5.7 SEMANTIC COMPOSITION, 63 3.5.2 SEMANTIC
GRAMMARS, 66 3.6 OFFBEAT USES FOR DCG RULES 66 3.7 EXCURSUS:
TRANSITION-NETWORK PARSERS 68 3.7.1 STATES AND TRANSITIONS, 68 3.7.2
RECURSIVE TRANSITION NETWORKS, 71 3.7.3 AUGMENTED TRANSITION NETWORKS
(ATNS), 72 4 ENGLISH PHRASE STRUCTURE 77 4.1 PHRASE STRUCTURE 77 4.1.1
TREES REVISITED, 78 4.1.2 CONSTITUENTS AND CATEGORIES, 79 4.1.3
STRUCTURAL AMBIGUITY, 80 4.2 TRADITIONAL GRAMMAR 82 4.2.1 PARTS OF
SPEECH, 82 4.2.2 GRAMMATICAL RELATIONS, 84 4.3 THE NOUN PHRASE AND ITS
MODIFIERS 85 4.3.1 SIMPLE NPS, 85 4.3.2 MULTIPLE ADJECTIVE POSITIONS, 87
4.3.3 ADJECTIVE PHRASES, 88 4.3.4 SENTENCES WITHIN NPS, 88 4.4 THE VERB
PHRASE 90 4.4.1 VERBS AND THEIR COMPLEMENTS, 90 4.4.2 PARTICLES, 93
4.4.3 THE COPULA, 93 4.5 OTHER STRUCTURES 96 4.5.1 CONJUNCTIONS, 96
4.5.2 SENTENTIAL PPS, 99 4.6 WHERE PS RULES FAIL 101 4.6.1 ADVERBS AND
ID/LP FORMALISM, 101 4.6.2 POSTPOSING OF LONG CONSTITUENTS, 104 4.6.3
UNBOUNDED MOVEMENTS, 105 4.6.4 TRANSFORMATIDNAL GRAMMAR, 108 4.7 FURTHER
READING 110 5 UNIFICATION-BASED GRAMMAR 111 5.1 A UNIFICATION-BASED
FORMALISM 111 X CONTENTS 5.1.1 THE PROBLEM, 111 5.1.2 WHAT IS UBG?, ILL
5.1.3 HOW FEATURES BEHAVE, 112 5.1.4 FEATURES AND PS RULES, 114 5.1.5
FEATURE-STRUCTURE UNIFICATION, 115 5.2 A SAMPLE GRAMMAR 117 5.2.1
OVERVIEW, 117 5.2.2 LEXICAL ENTRIES, 118 5.2.3 PHRASE-STRUCTURE RULES,
119 5.2.4 HOW THE RULES FIT TOGETHER, 121 5.3 FORMAL PROPERTIES OF
FEATURE STRUCTURES 123 5.3.1 FEATURES AND VALUES, 123 5.3.2 RE-ENTRANCY,
126 5.3.3 FUNCTIONS, PATHS, AND EQUATIONAL STYLE, 128 5.4 AN EXTENSION
OF PROLOG FOR UBG 130 5.4.1 A BETTER SYNTAX FOR FEATURES, 130 5.4.2
TRANSLATING A SINGLE FEATURE STRUCTURE, 132 5.4.3 TRANSLATING TERMS OF
ALL TYPES, 134 5.4.4 TRANSLATING WHILE CONSULTING, 136 5.4.5 OUTPUT OF
FEATURE STRUCTURES, 138 5.5 UBG IN THEORY AND PRACTICE 141 5.5.1 A MORE
COMPLEX GRAMMAR, 141 5.5.2 CONTEXT-FREE BACKBONES AND SUBCATEGORIZATION
LISTS, 146 5.5.3 NEGATIVE AND DISJUNCTIVE FEATURES, 149 6 PARSING
ALGORITHMS 151 6.1 COMPARING PARSING ALGORITHMS 151 6.2 TOP-DOWN PARSING
151 6.3 BOTTOM-UP PARSING 155 6.3.1 THE SHIFT-REDUCE ALGORITHM, 155
6.3.2 SHIFT-REDUCE IN PROLOG, 157 6.4 LEFT-COMER PARSING 158 6.4.1 THE
KEY IDEA, 158 6.4.2 THE ALGORITHM, 160 6.4.3 LINKS, 162 6.4.4 BUP, 165
6.5 CHART PARSING 167 CONTENTS XI 6.5.7 THE KEY IDEA, 167 6.5.2 A FIRST
IMPLEMENTATION, 168 6.5.3 REPRESENTING POSITIONS NUMERICALLY, 170 6.5.4
COMPLETENESS, 171 6.5.5 SUBSUMPTION, 174 6.6 EARLEY S ALGORITHM 176
6.6.1 THE KEY IDEA, 176 6.6.2 AN IMPLEMENTATION, 177 6.6.3 PREDICTOR,
180 6.6.4 SCANNER, 182 6.6.5 COMPLETER, 182 6.6.6 HOW EARLEY S ALGORITHM
AVOIDS HOPS, 183 6.6.7 HANDLING NULL CONSTITUENTS, 184 6.6.8 SUBSUMPTION
REVISITED, 185 6.6.9 RESTRICTION, 186 6.6.10 IMPROVING EARLEY S
ALGORITHM, 188 6.6.11 EARLEY S ALGORITHM AS AN INFERENCE ENGINE, 188 6.7
WHICH PARSING ALGORITHM IS REALLY BEST? 191 6.7.7 DISAPPOINTING NEWS
ABOUT PERFORMANCE, 191 6.7.2 COMPLEXITY OF PARSING, 193 6.7.3 FURTHER
READING, 195 7 SEMANTICS, LOGIC, AND MODEL THEORY 196 7.1 THE PROBLEM OF
SEMANTICS 196 7.2 FROM ENGLISH TO LOGICAL FORMULAS 197 7.2.7 LOGIC AND
MODEL THEORY, 197 7.2.2 SIMPLE WORDS AND PHRASES, 198 7.2.3 SEMANTICS OF
THE N 1 CONSTITUENT, 201 7.3 QUANTIFIERS (DETERMINERS) 203 7.3.7
QUANTIFIERS IN LANGUAGE, LOGIC, AND PROLOG, 203 7.3.2 RESTRICTOR AND
SCOPE, 205 7.3.3 STRUCTURAL IMPORTANCE OF DETERMINERS, 207 7.3.4
BUILDING QUANTIFIED STRUCTURES, 207 7.3.5 SCOPE AMBIGUITIES, 212 7.4
QUESTION ANSWERING 214 7.4.1 SIMPLE YES/NO QUESTION, 214 7.4.2 GETTING A
LIST OF SOLUTIONS, 215 7.4.3 WHO/WHAT/WHICH QUESTIONS, 217 7.5 FROM
FORMULA TO KNOWLEDGE BASE 219 7.5.7 DISCOURSE REFERENTS, 219 XII
CONTENTS 7.5.2 ANAPHORA, 221 7.5.3 DEFINITE REFERENCE (THE), 224 7.5.4
PLURALS, 225 7.5.5 MASS NOUNS, 227 7.6 NEGATION 228 7.6.7 NEGATIVE
KNOWLEDGE, 228 7.6.2 NEGATION AS A QUANTIFIER, 229 7.6.3 SOME LOGICAL
EQUIVALENCES, 230 7.7 FURTHER READING 232 8 FURTHER TOPICS IN SEMANTICS
233 8.1 BEYOND MODEL THEORY 233 8.2 LANGUAGE TRANSLATION 233 8.2.1
BACKGROUND, 233 8.2.2 A SIMPLE TECHNIQUE, 234 8.2.3 SOME LATIN GRAMMAR,
235 8.2.4 A WORKING TRANSLATOR, 237 8.2.5 WHY TRANSLATION IS HARD, 238
8.3 WORD-SENSE DISAMBIGUATION 239 8.3.1 THE PROBLEM, 239 8.3.2
DISAMBIGUATION BY ACTIVATING CONTEXTS, 240 8.3.3 FINDING THE BEST
COMPROMISE, 244 8.3.4 SPREADING ACTIVATION, 247 8.4 UNDERSTANDING EVENTS
248 8.4.1 EVENT SEMANTICS, 248 8.4.2 TIME AND TENSE, 251 8.4.3 SCRIPTS,
252 8.5 FURTHER READING 256 9 MORPHOLOGY AND THE LEXICON 257 9.1 HOW
MORPHOLOGY WORKS 257 9.7.7 THE NATURE OF MORPHOLOGY, 257 9.1.2 MORPHEMES
AND ALLOMORPHS, 258 9.2 ENGLISH INFLECTION 260 9.2.7 THE SYSTEM, 269
9.2.2 MORPHOGRAPHEMICS (SPELLING RULES), 262 9.3 IMPLEMENTING ENGLISH
INFLECTION 263 CONTENTS XIII 9.3.7 LEXICAL LOOKUP, 263 9.3.2 LETTER
TREES IN PROLOG, 264 9.3.3 HOW TO REMOVE A SUFFIX, 268 9.3.4
MORPHOGRAPHEMIC TEMPLATES AND RULES, 268 9.3.5 CONTROLLING
OVERGENERATION, 271 9.4 ABSTRACT MORPHOLOGY 272 9.4.1 UNDERLYING FORMS,
272 9.4.2 MORPHOLOGY AS PARSING, 275 9.4.3 TWO-LEVEL MORPHOLOGY, 276
9.4.4 RULES AND TRANSDUCERS, 277 9.4.5 FINITE-STATE TRANSDUCERS IN
PROLOG, 279 9.4.6 CRITIQUE OF TWO-LEVEL MORPHOLOGY, 281 9.5 FURTHER
READING 282 APPENDICES A: REVIEW OF PROLOG 283 A.I BEYOND INTRODUCTORY
PROLOG 283 A.2 BASIC DATA TYPES 283 A.2.7 TERMS, 283 A.2.2 INTERNAL
REPRESENTATION OF ATOMS, 284 A.2.3 COMPOUND TERMS (STRUCTURES), 285
A.2.4 INTERNAL REPRESENTATION OF STRUCTURES, 286 A.2.5 LISTS, 287 A.2.6
INTERNAL REPRESENTATION OF LISTS, 288 A.2.7 STRINGS, 289 A.2.8
CHARLISTS, 289 A.3 SYNTACTIC ISSUES 290 A.3.7 OPERATORS, 290 A.3.2 THE
DECEPTIVE HYPHEN, 290 A.3.3 THE DUAL ROLE OF PARENTHESES, 291 A.3.4 THE
TRIPLE ROLE OF COMMAS, 291 A.3.5 OP DECLARATIONS, 292 A.4 VARIABLES AND
UNIFICATION 293 A.4.1 VARIABLES, 293 A.4.2 UNIFICATION, 293 A.5 PROLOG
SEMANTICS 294 A5.7 STRUCTURE OF A PROLOG PROGRAM, 294 A.5.2 EXECUTION,
296 XIV CONTENTS A.5.3 BACKTRACKING, 297 A.5.4 NEGATION AS FAILURE, 297
A.5.5 CUTS, 298 A.5.6 DISJUNCTION, 299 A.5.7 CONTROL STRUCTURES NOT USED
IN THIS BOOK, 300 A.5.8 SELF-MODIFYING PROGRAMS, 300 A.5.9 DYNAMIC
DECLARATIONS, 302 A.6 INPUT AND OUTPUT 302 A.6.7 THE PROLOG READER, 302
A.6.2 THE WRITER, 303 A.6.3 CHARACTER INPUT-OUTPUT, 304 A.6.4 FILE
INPUT-OUTPUT, 305 A.7 EXPRESSING REPETITIVE ALGORITHMS 306 A. 7.7 REPEAT
LOOPS, 306 A.7.2 RECURSION, 307 A.7.3 TRAVERSING A LIST, 308 A.7.4
TRAVERSING A STRUCTURE, 309 A.7.5 ARRAYS IN PROLOG, 310 A. 8 EFFICIENCY
ISSUES 311 A.8.1 TAIL RECURSION, 311 A.8.2 INDEXING, 312 A.8.3 COMPUTING
BY UNIFICATION ALONE, 313 A.8.4 AVOIDANCE OFCONSING, 314 A.9 SOME POINTS
OF PROLOG STYLE 314 A.9.7 PREDICATE HEADERS, 314 A.9.2 ORDER OF
ARGUMENTS, 315 B: STRING INPUT AND TOKENIZATION 317 B.I THE PROBLEM 317
B.2 BUILT-IN SOLUTIONS 318 B.3 IMPLEMENTING A TOKENIZER 318 B.4 HANDLING
NUMBERS CORRECTLY 320 B.5 CREATING CHARLISTS RATHER THAN ATOMS 322 B.6
USING THIS CODE IN YOUR PROGRAM 322 BIBLIOGRAPHY 325 INDEX 335
|
| any_adam_object | 1 |
| author | Covington, Michael A. |
| author_facet | Covington, Michael A. |
| author_role | aut |
| author_sort | Covington, Michael A. |
| author_variant | m a c ma mac |
| building | Verbundindex |
| bvnumber | BV008283702 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.P76 |
| callnumber-search | QA76.73.P76 |
| callnumber-sort | QA 276.73 P76 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)299750031 (DE-599)BVBBV008283702 |
| dewey-full | 005.13/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13/3 |
| dewey-search | 005.13/3 |
| dewey-sort | 15.13 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01548nam a2200397 c 4500</leader><controlfield tag="001">BV008283702</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931021s1994 d||| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0136292135</subfield><subfield code="9">0-13-629213-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)299750031</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008283702</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.73.P76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/3</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Covington, Michael A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Natural language processing for prolog programmers</subfield><subfield code="c">Michael A. Covington</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Englewood Cliffs, NJ</subfield><subfield code="b">Prentice Hall</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 348 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Natuurlijke-taalverwerking</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">PROLOG</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">PROLOG</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4047464-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Sprachverarbeitung</subfield><subfield code="0">(DE-588)4116579-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">PROLOG</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4047464-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Sprachverarbeitung</subfield><subfield code="0">(DE-588)4116579-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005473571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005473571</subfield></datafield></record></collection> |
| id | DE-604.BV008283702 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:17:44Z |
| institution | BVB |
| isbn | 0136292135 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005473571 |
| oclc_num | 299750031 |
| open_access_boolean | |
| owner | DE-29 DE-29T |
| owner_facet | DE-29 DE-29T |
| physical | XVI, 348 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Prentice Hall |
| record_format | marc |
| spelling | Covington, Michael A. Verfasser aut Natural language processing for prolog programmers Michael A. Covington Englewood Cliffs, NJ Prentice Hall 1994 XVI, 348 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Natuurlijke-taalverwerking gtt PROLOG gtt Natural language processing (Computer science) Prolog (Computer program language) PROLOG Programmiersprache (DE-588)4047464-1 gnd rswk-swf Sprachverarbeitung (DE-588)4116579-2 gnd rswk-swf PROLOG Programmiersprache (DE-588)4047464-1 s Sprachverarbeitung (DE-588)4116579-2 s DE-604 HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005473571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Covington, Michael A. Natural language processing for prolog programmers Natuurlijke-taalverwerking gtt PROLOG gtt Natural language processing (Computer science) Prolog (Computer program language) PROLOG Programmiersprache (DE-588)4047464-1 gnd Sprachverarbeitung (DE-588)4116579-2 gnd |
| subject_GND | (DE-588)4047464-1 (DE-588)4116579-2 |
| title | Natural language processing for prolog programmers |
| title_auth | Natural language processing for prolog programmers |
| title_exact_search | Natural language processing for prolog programmers |
| title_full | Natural language processing for prolog programmers Michael A. Covington |
| title_fullStr | Natural language processing for prolog programmers Michael A. Covington |
| title_full_unstemmed | Natural language processing for prolog programmers Michael A. Covington |
| title_short | Natural language processing for prolog programmers |
| title_sort | natural language processing for prolog programmers |
| topic | Natuurlijke-taalverwerking gtt PROLOG gtt Natural language processing (Computer science) Prolog (Computer program language) PROLOG Programmiersprache (DE-588)4047464-1 gnd Sprachverarbeitung (DE-588)4116579-2 gnd |
| topic_facet | Natuurlijke-taalverwerking PROLOG Natural language processing (Computer science) Prolog (Computer program language) PROLOG Programmiersprache Sprachverarbeitung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005473571&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT covingtonmichaela naturallanguageprocessingforprologprogrammers |