Create aregularexpressionfor cat & catsDefinecodomainDefineDomainStringDistanceUnioninRegexConcatenationin RegexKleeneStar inRegexDefineDFATerminalsin a treeIndexationin a treeDifferencebetweensetsWeakEquivalenceRelationsvs.FunctionsNon-terminalsin a treeCardinalityDefineNFADepth-firstsearchEquivalenceof NFA andDFAInjectiveFunctionLevenshteinDistanceSurjectiveFunctionDescribeLemmatizationBreadth-firstsearchBijectiveFunctionCreate aregularexpressionfor cat & catsDefinecodomainDefineDomainStringDistanceUnioninRegexConcatenationin RegexKleeneStar inRegexDefineDFATerminalsin a treeIndexationin a treeDifferencebetweensetsWeakEquivalenceRelationsvs.FunctionsNon-terminalsin a treeCardinalityDefineNFADepth-firstsearchEquivalenceof NFA andDFAInjectiveFunctionLevenshteinDistanceSurjectiveFunctionDescribeLemmatizationBreadth-firstsearchBijectiveFunction

Computational Linguistics Bingo - Call List

(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
  1. Create a regular expression for cat & cats
  2. Define codomain
  3. Define Domain
  4. String Distance
  5. Union in Regex
  6. Concatenation in Regex
  7. Kleene Star in Regex
  8. Define DFA
  9. Terminals in a tree
  10. Indexation in a tree
  11. Difference between sets
  12. Weak Equivalence
  13. Relations vs. Functions
  14. Non-terminals in a tree
  15. Cardinality
  16. Define NFA
  17. Depth-first search
  18. Equivalence of NFA and DFA
  19. Injective Function
  20. Levenshtein Distance
  21. Surjective Function
  22. Describe Lemmatization
  23. Breadth-first search
  24. Bijective Function