github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-24 07:25:44 +03:00
Code Issues Projects Releases Wiki Activity
7,196 Commits 19 Branches 16 Tags 46 MiB
449c564179
Commit Graph

3053 Commits

Author SHA1 Message Date
Rob Rix
be674ecd97 📝 firstAnnotation. 2016-07-05 09:35:47 -04:00
Rob Rix
1e2ff9340f 📝 Gram. 2016-07-05 09:34:17 -04:00
Rob Rix
f53e7d61dd 📝 pqGrams. 2016-07-05 09:32:03 -04:00
Rob Rix
0a498656c7 🔥 serialize. 2016-07-05 09:30:28 -04:00
Rob Rix
952cb298eb 📝 windowed. 2016-07-05 09:29:27 -04:00
Rob Rix
3daf7f96ca 📝 featureVector. 2016-07-05 09:27:44 -04:00
Rob Rix
9632bea377 📝 vmagnitude. 2016-07-05 09:26:34 -04:00
Rob Rix
cf6a5d77a6 Tacit definition of vmagnitude. 2016-07-05 09:25:08 -04:00
Rob Rix
7f6fc45116 📝 gramWithPQ. 2016-07-05 09:21:49 -04:00
Rob Rix
84e739e540 🔥 the Bag type synonym. 2016-07-05 09:20:16 -04:00
Rob Rix
d6fef50ad5 Add a heading for the instances. 2016-07-05 09:19:36 -04:00
Rob Rix
f5ce4e0822 🔥 the nearestNeighbour function. 2016-07-05 09:19:30 -04:00
Rob Rix
4cfa993239 Move the Arbitrary gram functions into Data.RandomWalkSimilarity. 2016-07-05 09:18:53 -04:00
Rob Rix
827d654485 Use List.lookup and replace the found term. 2016-07-04 16:50:01 -04:00
Rob Rix
a8effb6d6d Don’t filter, just operate over the unmapped list. 2016-07-04 15:29:22 -04:00
Rob Rix
89df373821 We don’t need to bind this after all. 2016-07-04 15:25:07 -04:00
Rob Rix
c724f61f49 Insert deletions in the correct position. 2016-07-04 15:20:18 -04:00
Rob Rix
ea9cbbd1e7 Keep track of the unmapped diffs, not the mapped ones. 2016-07-04 15:19:15 -04:00
Rob Rix
7b75edcb78 Don’t reconstruct the key/value pairs. 2016-07-04 15:06:21 -04:00
Rob Rix
f34e9a6a0a 🔥 a redundant import. 2016-07-04 15:04:35 -04:00
Rob Rix
063aeea8b0 Use leaf values in the labels. 2016-06-30 15:03:32 -04:00
Rob Rix
e967668572 Require a Hashable instance for the leaf type. 2016-06-30 15:03:00 -04:00
Rob Rix
02965e2edb Cons. 2016-06-30 14:58:00 -04:00
Rob Rix
3cd2a4b82c Extract a function to select the category. 2016-06-30 14:24:59 -04:00
Rob Rix
e54f216672 Shrink ArbitraryDiff generically. 2016-06-30 14:19:29 -04:00
Rob Rix
0770a410d4 Represent ArbitraryDiff as a datatype. 2016-06-30 14:19:22 -04:00
Rob Rix
5b70ff7635 Extract unArbitraryDiff. 2016-06-30 14:16:37 -04:00
Rob Rix
99ffbebd84 Construct ArbitraryDiff using the extracted syntaxOfSize function. 2016-06-30 14:14:41 -04:00
Rob Rix
2d821fec97 Construct ArbitraryTerm using the extracted syntaxOfSize function. 2016-06-30 14:13:39 -04:00
Rob Rix
84b550262e Shrink ArbitraryTerm generically. 2016-06-30 14:13:29 -04:00
Rob Rix
8d043e7de9 Add an Arbitrary instance over Syntax. 
This also implements sized arbitrary values.
 2016-06-30 14:10:44 -04:00
Rob Rix
03b6964d7c Derive a Generic instance over Syntax. 2016-06-30 14:10:12 -04:00
Rob Rix
dd71aa0c6e Add an Arbitrary instance over OrderedMap. 2016-06-30 14:09:55 -04:00
Rob Rix
19905faee8 Derive a Generic instance for Data.OrderedMap. 2016-06-30 14:08:01 -04:00
Rob Rix
72a909ac52 ArbitraryTerm does not wrap CofreeF. 2016-06-30 14:01:54 -04:00
Rob Rix
d9e4602c67 Spacing. 2016-06-30 13:45:44 -04:00
Rob Rix
d674dd06b6 Require the fields to have an Ord instance. 2016-06-30 12:59:56 -04:00
Rob Rix
e914685790 Don’t warn of orphans so much. 2016-06-30 12:59:26 -04:00
Rob Rix
ad3bb31c0d Derive an Ord instance over Patch. 2016-06-30 12:51:11 -04:00
Rob Rix
ee393400f2 Formatting. 2016-06-30 12:50:52 -04:00
Rob Rix
28abcd1b38 Move Record’s Arbitrary instance into Data.Record. 2016-06-30 12:49:50 -04:00
Rob Rix
60b92bfedf Derive Ord instances for Size and Cost. 2016-06-30 12:47:21 -04:00
Rob Rix
605a5a9ce1 Add an Ord instance over Data.Record. 2016-06-30 12:46:22 -04:00
Rob Rix
1a35975c4f Memoize the feature vector computation for bs. 2016-06-30 12:19:01 -04:00
Rob Rix
6e1a7957ec Implement Recursive diffing pairwise over lists of inequal length. 2016-06-30 11:59:33 -04:00
Rob Rix
a679749112 Test for subtree membership, not just key membership. 2016-06-30 11:36:55 -04:00
Rob Rix
d6c041074c Use a List instead of a Set. 2016-06-30 11:35:27 -04:00
Rob Rix
7bdbb0a963 Derive an Ord instance for Syntax. 2016-06-29 11:23:11 -04:00
Rob Rix
4c3c85bf87 Derive an Ord instance for OrderedMap. 2016-06-29 11:23:06 -04:00
Rob Rix
92fb23b65e Revert "Revert "Define all our constants in one go."" 
This reverts commit 6cb041549d0c8701c10e4574ede0af1ecc87881c.
 2016-06-29 10:31:16 -04:00
Rob Rix
11a2ab907a Revert "Carry indices along through the computation." 
This reverts commit 2cc2d4d78688266a4a6791de47bfd27bfa3cca43.
 2016-06-29 10:30:32 -04:00
Rob Rix
a5cce717c8 Revert "Carry the indices all the way along." 
This reverts commit 35b54a6bd9f53d79767571e9ea0bdccf13506149.
 2016-06-29 10:30:28 -04:00
Rob Rix
223d549397 Revert "Place the index last." 
This reverts commit a7ff749b2d0fb5991b8b20c97cd1855105d48b49.
 2016-06-29 10:30:24 -04:00
Rob Rix
b49997d83e Revert "Don’t drop the indices until the very last." 
This reverts commit a47ac6be869e7ee65482a2f8606553f2ca9f8dd2.
 2016-06-29 10:30:21 -04:00
Rob Rix
237846979e Revert "DRY up the computation of indexed, feature-assigned lists." 
This reverts commit 40d1b8b449f61613ec40f0e7a7b7acb41189c53a.
 2016-06-29 10:30:17 -04:00
Rob Rix
31786e1357 Revert "Define all our constants in one go." 
This reverts commit 77c6cb8d94ccc4bd53d142851e815a74bfc79f14.
 2016-06-29 10:30:10 -04:00
Rob Rix
79d05c9520 Revert "Don’t bind the after list’s index." 
This reverts commit f5ef37312654f188a707a75e4994f4420b768516.
 2016-06-29 10:29:37 -04:00
Rob Rix
b81fc5166d Revert "Split out the computation of the deletions." 
This reverts commit 06b52e9366d99739facb7e6aaff965b9dc634dee.
 2016-06-29 10:29:30 -04:00
Rob Rix
9f6176a6cc Split out the computation of the deletions. 2016-06-29 10:16:31 -04:00
Rob Rix
e5423587c5 Define all our constants in one go. 2016-06-29 10:15:35 -04:00
Rob Rix
d56f2176b9 Don’t bind the after list’s index. 2016-06-29 10:12:25 -04:00
Rob Rix
457082ba6f DRY up the computation of indexed, feature-assigned lists. 2016-06-29 10:11:38 -04:00
Rob Rix
53cfdb8f15 Don’t drop the indices until the very last. 2016-06-29 10:07:38 -04:00
Rob Rix
b2003de8d4 Place the index last. 2016-06-29 10:06:35 -04:00
Rob Rix
5cb8d1ddc6 Carry the indices all the way along. 2016-06-29 10:05:24 -04:00
Rob Rix
488280d40d Carry indices along through the computation. 2016-06-29 10:01:41 -04:00
Rob Rix
ad930bf047 Tidy up with fromMaybe. 2016-06-28 15:04:04 -04:00
Rob Rix
be3f43702b Replace incomparable terms. 2016-06-28 15:01:02 -04:00
Rob Rix
2dde2a5775 🔥 some parens. 2016-06-28 14:56:01 -04:00
Rob Rix
88a79d736c Invert the predicate. 2016-06-28 13:42:23 -04:00
Rob Rix
16b0fedee5 Delete the remaining terms in a. 2016-06-27 16:06:50 -04:00
Rob Rix
c9733cdc5a Swap the operands to compare. 2016-06-27 15:59:37 -04:00
Rob Rix
ddc418bc57 Correct the before/after definitions to select the correct side. 2016-06-27 13:29:22 -04:00
Rob Rix
41902045b4 Define an afterTerm function over diffs. 2016-06-27 12:50:25 -04:00
Rob Rix
8fcbaa3a7e Define beforeTerm via mergeMaybe. 2016-06-27 12:50:10 -04:00
Rob Rix
8f7307c989 Add a partial merge function. 2016-06-27 12:49:44 -04:00
Rob Rix
9829d2df84 Add a merge function to compute a Term from a Diff. 2016-06-27 12:37:27 -04:00
Rob Rix
3f6cab2abc Add a function to compute the before state of a diff. 2016-06-27 12:02:25 -04:00
Rob Rix
102b9cbfa6 Skip mapped children. 2016-06-24 11:27:42 -04:00
Rob Rix
2bb046c65a Rewrite with case again. 2016-06-24 11:13:04 -04:00
Rob Rix
5724d2cbb3 Use k-d trees to look up the nearest neighbour. 2016-06-24 11:10:18 -04:00
Rob Rix
b69e87f4f5 Rename diffAgainstNearestNeighbour to findNearestNeighbourTo. 2016-06-24 10:47:34 -04:00
Rob Rix
dff102aaa6 Clean up the nested cases on Maybe with do notation. 2016-06-24 10:20:31 -04:00
Rob Rix
1dac9cfb08 Diff against nearest neighbours. 2016-06-23 16:46:58 -04:00
Rob Rix
b5f9d94e80 Pass a getLabel function to rws. 2016-06-23 16:34:43 -04:00
Rob Rix
c1a2617fa1 Interpretation must operate over terms with extensible annotations. 2016-06-23 16:34:13 -04:00
Rob Rix
365e84301d Add an Arbitrary instance for Category. 2016-06-23 16:29:19 -04:00
Rob Rix
0dec4c2879 Add a header above the instances. 2016-06-23 16:25:49 -04:00
Rob Rix
b604ddd446 FlexibleContexts all the things. 2016-06-23 16:19:51 -04:00
Rob Rix
ae55c9480a Generalize nearestNeighbour. 2016-06-23 11:45:17 -04:00
Rob Rix
ed552da2af Swap the d/bag arguments in featureVector. 2016-06-23 10:34:23 -04:00
Rob Rix
6c8ee2958a Rename a to leaf. 2016-06-23 10:23:27 -04:00
Rob Rix
a657295ae6 Generalize pqGrams over a getLabel accessor again. 2016-06-23 10:18:39 -04:00
Rob Rix
c9b26f2da8 Category is Hashable. 2016-06-23 09:55:48 -04:00
Rob Rix
a58463007e Derive a Generic instance for Category. 2016-06-23 09:55:43 -04:00
Rob Rix
6133903e8c Extract the label from a record. 2016-06-23 09:52:15 -04:00
Rob Rix
9b8e9305e4 Shrink arbitrary records. 2016-06-23 09:46:44 -04:00
Rob Rix
656d8318ad Add an Arbitrary instance over Data.Record. 2016-06-23 09:45:41 -04:00
Rob Rix
4a8b7631bb Stub in a Data.Record.Arbitrary module. 2016-06-23 09:42:43 -04:00
Rob Rix
8d164480ee Extract the root stem assignment into a setRootStem function. 2016-06-23 09:39:08 -04:00
Rob Rix
2faf708435 Extract the root base assignment into a setRootBase function. 2016-06-23 09:37:43 -04:00
Rob Rix
167386fcfb Produce correct diffs in the general case. 2016-06-23 09:28:35 -04:00
Rob Rix
fc7dfe4f0f Diff all-inserted and all-deleted cases correctly. 2016-06-22 18:09:30 -04:00
Rob Rix
2d709e1fc7 Add RWS operations. 2016-06-22 18:09:11 -04:00
Rob Rix
7b3cb50165 Stub in an rws function. 2016-06-22 18:01:43 -04:00
Rob Rix
1170bfdcb2 Rename Data.Gram to Data.RandomWalkSimilarity. 2016-06-22 17:59:28 -04:00
Rob Rix
108decbcaa Reformatting. 2016-06-22 17:48:56 -04:00
Rob Rix
bc21d2f3b2 Find the nearest neighbour in the worst possible way. 2016-06-22 17:33:40 -04:00
Rob Rix
5684017e80 Extract magnitude to the top level. 2016-06-22 17:33:27 -04:00
Rob Rix
186c751d8d Set bases through key/value pairs. 2016-06-22 16:51:17 -04:00
Rob Rix
1273f1bce9 Assign sibling labels, padding out to q. 2016-06-22 16:46:56 -04:00
Rob Rix
4292d7d94e Provide each element to the windowed combining function. 2016-06-22 16:25:27 -04:00
Rob Rix
9877b71f96 Produce a single gram per child. 2016-06-22 16:24:54 -04:00
Rob Rix
f553cac094 Specialize pqGrams to Cofree of Syntax. 2016-06-22 16:17:54 -04:00
Rob Rix
5bdbf3eb7d 🔥 a type signature. 2016-06-22 16:09:59 -04:00
Rob Rix
ff5059dff1 Add a windowed fold operator. 2016-06-22 15:55:54 -04:00
Rob Rix
a5f1926b63 Tidying. 2016-06-22 15:21:54 -04:00
Rob Rix
f1d190326c Remove children from the unpacking function. 2016-06-22 15:18:37 -04:00
Rob Rix
dac5431c1b Fold instead of unpacking children. 2016-06-22 15:17:39 -04:00
Rob Rix
6e3c9ddd00 Flesh out stems from the root. 2016-06-22 15:15:44 -04:00
Rob Rix
6c36e80602 Try to define pqGrams as a hylomorphism. 2016-06-22 15:13:15 -04:00
Rob Rix
7ff1fb0021 Assign placeholder parents at the root. 2016-06-22 13:46:31 -04:00
Rob Rix
4d2af0684d Represent Gram labels in Maybe. 2016-06-22 11:52:50 -04:00
Rob Rix
dbcf4a2da0 Derive Eq & Show instances. 2016-06-22 11:01:52 -04:00
Rob Rix
e8428446e2 Shrink Grams. 2016-06-22 10:59:16 -04:00
Rob Rix
5bfd65b665 Use gramWithPQ for the Arbitrary instance. 2016-06-22 10:57:43 -04:00
Rob Rix
1d848e6dc3 Generate arbitrary p,q-grams. 2016-06-22 10:54:48 -04:00
Rob Rix
b85e2f27ce Add an Arbitrary instance over Grams. 2016-06-22 10:53:50 -04:00
Rob Rix
9a976869b2 Stub in a module for arbitrary grams. 2016-06-22 10:53:29 -04:00
Rob Rix
ae08777c52 Prepend p parent labels. 2016-06-22 10:21:37 -04:00
Rob Rix
fa760d7ae1 Assign parents. 2016-06-22 10:13:25 -04:00
Rob Rix
c1f1fb71c9 Unpack lists of children. 2016-06-22 10:12:59 -04:00
Rob Rix
f8f1a073f6 Produce the label at each node. 2016-06-22 10:02:44 -04:00
Rob Rix
2edbff580c Abstract the unpacking function universally. 2016-06-22 10:02:01 -04:00
Rob Rix
228f5212ee Unpack the label and children at each level. 2016-06-22 09:56:10 -04:00
Rob Rix
dda39902b2 Specialize the unpacking function type. 2016-06-22 09:56:01 -04:00
Rob Rix
91db911cd2 Stub in a function to compute the p,q-grams for a given tree. 2016-06-22 09:54:14 -04:00
Rob Rix
1d225b39ad Qualify our imports. 2016-06-22 09:37:02 -04:00
Rob Rix
51f3d3d11d Compute random Doubles instead. 2016-06-21 19:04:35 -04:00
Rob Rix
686f94d53e Compute feature vectors from Bags of p,q-grams. 2016-06-21 18:50:06 -04:00
Rob Rix
226be486c8 Add a Random instance over Ratios. 2016-06-21 18:48:44 -04:00
Rob Rix
ce838de9b4 Bags are DLists. 2016-06-21 17:49:34 -04:00
Rob Rix
0fb73b6d96 Grams are Hashable. 2016-06-21 17:29:49 -04:00
Rob Rix
87b9c1c8e2 Bags are Hashable. 2016-06-21 17:29:09 -04:00
Rob Rix
0e88786666 Add a Monoid instance for Bags. 2016-06-21 16:58:46 -04:00
Rob Rix
e6036c0d76 Stub in Bags. 2016-06-21 16:58:38 -04:00
Rob Rix
53b53a7c8f Serialize Grams to a flat list of labels. 2016-06-21 16:58:33 -04:00
Rob Rix
5df723fa5a Stub in Grams. 2016-06-21 16:58:19 -04:00
Rob Rix
f8988adf3b Stub in a module for Grams. 2016-06-21 15:19:44 -04:00
Rob Rix
87552e0ecb Generalize Alignment over annotations with ranges. 2016-06-17 14:07:35 -04:00