Create aregularexpressionfor cat & catsWeakEquivalenceLevenshteinDistanceBijectiveFunctionCardinalityTerminalsin a treeBreadth-firstsearchUnioninRegexDefineNFAStringDistanceEquivalenceof NFA andDFAKleeneStar inRegexSurjectiveFunctionInjectiveFunctionDefineDFANon-terminalsin a treeDefinecodomainRelationsvs.FunctionsDepth-firstsearchConcatenationin RegexDifferencebetweensetsIndexationin a treeDefineDomainDescribeLemmatizationCreate aregularexpressionfor cat & catsWeakEquivalenceLevenshteinDistanceBijectiveFunctionCardinalityTerminalsin a treeBreadth-firstsearchUnioninRegexDefineNFAStringDistanceEquivalenceof NFA andDFAKleeneStar inRegexSurjectiveFunctionInjectiveFunctionDefineDFANon-terminalsin a treeDefinecodomainRelationsvs.FunctionsDepth-firstsearchConcatenationin RegexDifferencebetweensetsIndexationin a treeDefineDomainDescribeLemmatization

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