Unification Grammars

 

Unification Grammars

Nissim Francez and Shuly Wintner

Cambridge University Press

Publication date: October 2011

ISBN: 9781107014176

324 pages

171 exercises

@book{ug-book,

  title = {Unification grammars},

  author = {Francez, Nissim and Wintner, Shuly},

  year = {2012},

  publisher = {Cambridge University Press},

  address = {New York, NY},

  url = {http://cl.haifa.ac.il/ug}

}

Reviews

Tracy Holloway King, Computational Linguistics 38(2), 441-442, June 2012

Mark-Jan Nederhof, Theory and Practice of Logic Programming, July 2012


Errata


Page 10, second line of Section 1.3.5, “clause” should be “clauses”.

Page 19, Example 1.6, a third S is needed above ∊.

Page 22, line 9, “a last-in-first-out” should be “last-in-first-out”.

Page 27, “French’’: “chien” should be “porte”, and “dog” should be “door”.

Page 29, line -11, “class” should be “classes”.

Page 40, third clause of Definition 2.5, “F” should be “f” (font).

Page 42, Definition 2.7. “subsequence” should be “prefix”. This affects also the definition of cycles

in AVMs (Definition 2.54, page 70), MRGs (page 122) and multi-AVMs (page 133).

Page 47, Example 2.10, the paragraph starting with “Assume that ...” does not belong in the example.

It is a part of the proof of Theorem 2.11 and should be moved to the bottom of the page.

Page 48, penultimate line, π⋅f should be π’⋅f

Page 50, line -4, first word “antisymmetric” should be deleted.

Page 62, Exercise 2.29, “for Theorem 2.54” should be “of Theorem 2.38”.

Page 63, line -13, (last line of step 2) the subsumption symbol should be changed to “=”.

Page 63, line -4, hat is missing over the subsumption symbol between Abs(A) and Abs(B).

Page 64, line 14, “illustrate example” should be “illustrate”.

Page 66, Definition 2.46, add {  } around second occurrence of X[...], and then U.

Page 66, Definition 2.47, line 2, second X should be {X} U.

Page 69, Example 2.20, third line, <GF> should be <G,F>.

Page 72, Theorem 2.60, add “not” before “antisymmetric”.

Page 73, Example 2.24, last line, [2] should be [3].

Page 73, Example 2.25, first line, [0] should be [1].

Page 73, Theorem 2.62, the parenthetical (i.e., |TagSet(M,X)|>1 and |TagSet(M’,X)|>1)

should be removed.

Page 81, line 1, “mapping” should be “mappings”.

Page 87, Definition 3.4, second line, “feature structures” should be “feature graphs”.

Page 89, line -4 and -5, “F” should be “f” (font).

Page 90, Example 3.3, first line, “Refer again to” should be “Refer again to (the first part of)”

Page 92, first line, hat is missing over the subsumption symbol between fs(A) and fs(C).

Page 94, line 2, “[a]” should be “[A]”.

Page 94, Exercise 3.10, “fsA” should be “fsA

Page 94, Exercise 3.13, “so” should be “neither”.

Page 94, line 10, space missing before “unification”.

Page 95, line -3, “cannot” should be “can”.

Page 96, Example 3.8, lines 16-19 should be indented one level less (the “if” on line 14 applies only to

line 15). Also, a final line (20) is missing, which should say “return q ̄A”.

Page 97, line 6, “n4.class” should be “n4.class” (font).

Page 97, line -5, “f” should be “F” (font).

Page 98, line 4, “f” should be “F” and “g” should be “G” (font).

Page 99, line 8, “(O” should be “O”.

Page 100, line -14, replace “operating on a pre-AFS and extending it in some way” by “operating on

a pre-AFS F and extending it in some way; these are Cl(F) (Definition 3.11), Eq(F) (Definition 3.15),

and Ty(F) (Definition 3.18).”

Page 101, line 5 and line 25, “i≤n” should be “i<n”.

Page 101, line 19 and line 21, “Paths” should be “PATHS” (font).

Page 102, line 2, “i≤n” should be “i<n”.

Page 105, line 10: “F1 ⋂ F2” should be “12

Page 105, Exercise 3.18, first item: s should be2.

Page 106, Example 3.12, line 11, “C” should be “Cl(F3)”.

Page 106, Example 3.12, line -4, “H*” should be “H*)”. The parentheses should read:

(π1 = Fπ3 and π2 = Gπ4 for some π3, πin H*).

Page 107, line 2, “never” should be “but never”.

Page 109, Theorem 3.28, line 3, “c” should be “C” (three times).

Page 112, line 6, “F” should be “f” (font).

Page 112, line -4, “c” should be “C”.

Page 117, line 9, “size” should be “side”.

Page 118, Definition 4.1, line 3: “nonempty, finite” should be “finite”.

Page 120, Definition 4.2, line 2: “1≤i≤j≤n” should be “1≤j≤k≤ ̄|R|”.

Page 120, Definition 4.2, line 3: add bars over qj and qk.

Page 123, Exercise 4.10, Add “For two MRGs of the same length” after “Prove or refute:”.

Page 126, Example 4.8, last line, add also “(<3,AGR>,<2,AGR>)” (for symmetry). This also affects

Example 4.9 (Page 127), Example 4.11 (Page 129), Example 4.21 (Page 137), and

Example 4.30 (Page 149).

Page 132, Definition 4.17, line 2, a vector sign is missing over M; line 3, first M should be Mi.

Page 133, Example 4.16, last line, “pval(M,<2,<F,H>>)” should be “pval(M,<1,<F,H>>)”.

Page 133, line 10: “An” should b “A”.

Page 133, line -7, “an” should be “a”.

Page 133, line -4, “4.37” should be “4.19”.

Page 134, line -6, “location” should be “location of”.

Page 135, Definition 4.20, last line, “X(a)” should be “Xa”.

Page 137, Definition 4.22, penultimate line, “Θσ” should be “Θσ(<i,π>)”. Then “X(a)” should be “Xa”.

Page 137, line -9, “them were” should be “them”.

Page 139, line -12, “104” should be “105”. Also on Page 140, first line of text.

Page 141, Example 4.24, “Ind” should be “Π”. Then, on the second line, “<1,NUM>” should

be “<2,NUM>” and all the symmetric pairs have to be added to equivalence relation.

Page 143, line 8, the word “or” should occur in the previous line, instead of the final “}” of line 7.

Page 144, Theorem 4.26, line 2: “| |” should be “|”. Also on Page 145, lines 2, 3, and 4.

Page 144, line 10, “||” should be “|”.

Page 144, line 16, “,” missing between “π1” and “π2”.

Page 148, Example 4.29, the third AVM in PTw(1,3) should have the value v for the feature CAT

  (instead of of d); this recurs three times in the example.

Page 154, “σ”, The third AVM should have the value v for the feature CAT (instead of d)

Page 155, Example 4.32, add “Consider the AMRSs of Example 4.24 (Page 141).” at the beginning.

Page 155, last line, the “=” sign and everything to its left should be removed.

Page 156, line -3, “4.34” should be “4.32”.

Page 157, line -5, “unification” should be “unification tree”.

Page 159, Example 4.35, the value “nom” occurs twice next to the tag [2], only one occurrence

is needed (in the tree and in the AMRSs).

Page 159, Example 4.35: in the last two equations, “σ” should be “σ’” and “τ” should be “τ’”.

Page 160, Example 4.36: the feature “NUM” has to be removed from the two “CAT: s” nodes in

both trees. The value “sg” should be removed from the tag [4] in the bottom tree. The tag [2] has

to be added before “nom” in the bottom tree.

Page 161, lines 19-20: “NUM” should be “CASE”, “sg” should be “nom”, “[4]” should be “[2]”, and the

remainder of the sentence beginning with “also” should be removed.

Page 161, Definition 4.36, third line, “σi” should be deleted.

Page 162, Example 4.37, “twolambssleep” should be “two lambs sleep” (spaces added; font change).

Page 163, Example 4.38, “two lams sleep” should be “two lambs sleep” (font change).

Page 164, line -5: “effecting” should be “affecting”.

Page 165, line 8, “a account” should be “account”.

Page 166, line 10, “distnce” should be “distance”.

Page 166, above Example 5.1, add “In this example and in future ones, the lexicon is only sketched for

purposes of illustration.”

Page 167, Exercise 5.2, add in the end “(up to the specific contents of the two lexicons, which should be

assumed identical)”.

Page 168, Example 5.3, “the sheep love her” should be “the sheep love her” (font change).

Page 169, Example 5.4, add a lexical entry for “the” with [CAT: d] as its AVM.

Page 173, penultimate line -11, “rule 4” should be “rule 3”.

Page 174, Example 5.7, The lexical entries of Rachel and Jacob should have, in addition, “CASE: [ ]”.

Also, lexical entries for “sheep” (with [CAT: n]) and “the” (with [CAT: d]) should be added.

Page 175, Example 5.8, line 3, “explicated” should be “is explicated”. In the tree, the value pl should be

explicated next to [4] above “shepherds”, not above “the”. The feature CAT should be added to all

elements of σ and σ’.

Page 176, Example 5.9, rule 3, “NUM: [4]” should be “NUM: [3]” in the rightmost AVM.

Page 180, line -8, “subcategroization” should be “subcategorization”.

Page 185, Example 5.17, the lexical entries of lamb and lambs should have “CASE: [ ]”

  instead of “CASE: [2]”.

Page 189, middle, “whom” should be “who” in the second set of examples. The same holds for

Exercise 5.14 on Page 190.

Page 190, line 5, replace “Rule (7)” by “Rule (3) above (Page 186)”. Then remove Rule (7).

Page 192, Example 5.22, remove [NUM: [1]] from the AVM below the root; add [NUM: [6]] to the

AVM above the proper noun.

Page 194, Example 5.25, replace [4] by [3] (twice).

Page 195, Example 5.26, replace “acc” by “nom” above “Rachel”. Remove “NUM: [4]” at the S’.

Page 196, Example 5.28, replace [4] by [3] (twice).

Page 195, penultimate line, “a lamb that loved Rachel” should be “a lamb that loved Rachel” (font).

Page 198, line 4, “work” should be “work” (font).

Page 198, line 5, “to work” should be “to work” (font).

Page 199, Example 5.30,  the lexical entries of lamb and lambs should have “CASE: [ ]”

  instead of “CASE: [6]”. The lexical entries of all verbs should have “VFORM: fin”. This also applies

  to the (edge corresponding to the) lexical entry of “sleep” on Page 272.

Page 202, line 18, “but” should be “but” (font).

Page 207, line 11, “n+” should be “N+” (font).

Page 211, line -14, “a more restricted” should be “more restricted”.

Page 213, line 5, “expresiveness” should be “expressiveness”.

Page 215, line 8, “of of” should be “of”.

Page 217, line -6, “derives a string” should be “derive strings”.

Page 222, line 2, “σ(1,n)” should be “σ(a,n)”.

Page 222, lines 5 and 6: “G” should be “Gabc”.

Page 226, line 20, “if is believed” should be “it is believed”.

Page 230, line -3, “Turning” should be “Turing”.

Page 238, line 8, “constitute” should be “constitutes”.

Page 240, Example 6.12, “¬y” should be “y̅”.

Page 240, Example 6.12, last line, “))” should be “)”.

Page 246, line 4, remove “if”.

Page 246, Definition 6.26, item 2, “As” should be “As”. Also three times on Page 247.

Page 251, line -11, “languages” should be “language”.

Page 251, line -9, “unifiabe” should be “unifiable”.

Page 253, Exercise 6.22, “183” should be “184”.

Page 253, line -10, “they” should be “the”.

Page 255, line -10, “w” should be “|w|”.

Page 258, Example 6.26, “smiled” should be “smiled” (font).

Page 259, Lemma 6.36, “Y” should be “Y” (font).

Page 261, Example 6.28, line 17, “S” should be “Sγ• for some γ”.

Page 262, line -1, add “the” before “chart” and change “is empty” to “has no complete edges”.

Page 266, line 4, “Is it” should be “It is”.

Page 266, Example 6.29, line 3, “induces” should be “induced”. Then, in the formula, “n” should

be removed.

Page 270, Definition 6.38, line 1, “ρ” should be “ρ1”.

Page 271, last line, “the lambs sleep” should be “two lambs sleep”.

Page 276, line 18, “am operational” should be “an operational”.

Page 280, line -10, “of for” should be “if for”.

Page 281, line -10, “somain” should be “domain”.

Page 285, Solution 1.11, last line, “S” should be “(S)”.

Page 286, Solution 2.16, the solution should be: “False: see Exercise 2.20”.

Page 289, Solution 3.15, “sg” should be “a”.

Page 289, Solution 4.2, last line, “2” should be “3”; an additional edge labeled “agr” should be added.

Page 289, Solution 4.3, the second graph needs an additional edge, from q2 to q7. On Page 290, the

last two graphs should be removed, the result is equal to A.

Page 293, Solution 5.6, “pl” should be “sg” above “she. Also add “CASE: [3]” above “she” in both trees.

Page 294, Solution 5.9, “pl” should be “sg” above “she. Also add “CASE: [3]” above “she”.

Page 302, middle, “Kay” should be “Kay,”.


Many thanks are due to the following people for spotting these issues: Tracy Holloway King,

Mark-Jan Nederhof, Guy Emerson, Livnat Herzig Sheinfux, Jakub Waszczuk, and Agata Savary.

If you encounter any other errors, we would be grateful if you could let us know.