Timeline for Regex search for word roots with common prefixes
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2015 at 18:19 | history | tweeted | twitter.com/#!/StackUnix/status/630805687346548737 | ||
| Jul 28, 2015 at 22:57 | answer | added | don_crissti | timeline score: 0 | |
| Jul 28, 2015 at 20:22 | history | edited | DopeGhoti | CC BY-SA 3.0 |
Make title more clear
|
| Jul 28, 2015 at 20:20 | answer | added | DopeGhoti | timeline score: 3 | |
| Jul 28, 2015 at 20:17 | comment | added | glenn jackman |
uniq -d! very nice.
|
|
| Jul 28, 2015 at 20:17 | comment | added | DopeGhoti |
Aha! egrep '^(pro|con).* /usr/share/dict/words | sed 's/^...//' | sort | uniq -d will give you a list of all the word-bases that have both a pro and con prefix!
|
|
| Jul 28, 2015 at 20:17 | answer | added | glenn jackman | timeline score: 0 | |
| Jul 28, 2015 at 20:12 | comment | added | DopeGhoti |
Something like egrep '^(pro|con).*' /usr/share/dict/words might do the trick as a starting point, perhaps. You could then put the resultant list through a sed, awk, or grep meatgrinder that only keeps paired words.
|
|
| Jul 28, 2015 at 20:05 | review | First posts | |||
| Jul 28, 2015 at 20:09 | |||||
| Jul 28, 2015 at 20:03 | history | asked | smitelli | CC BY-SA 3.0 |